Minimizing Total Weighted Completion Time on Single Machine with Past-Sequence-Dependent Setup Times and Exponential Time-Dependent and Position-Dependent Learning Effects
نویسندگان
چکیده
منابع مشابه
Minimizing Total Weighted Completion Time on Single Machine with Past-Sequence-Dependent Setup Times and Exponential Time-Dependent and Position-Dependent Learning Effects
This paper addresses a single-machine problem in which the past-sequence-dependent p-s-d setup times and exponential time-dependent and position-dependent learning effects are considered. By the exponential time-dependent learning effect, it means that the processing time of a job is defined by an exponent function of the total actual processing time of the already processed jobs. The setup tim...
متن کاملAn Iterated Greedy Algorithm for Flexible Flow Lines with Sequence Dependent Setup Times to Minimize Total Weighted Completion Time
This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an iterated greedy algorithm (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other exist...
متن کاملSingle-machine scheduling considering carryover sequence-dependent setup time, and earliness and tardiness penalties of production
Production scheduling is one of the very important problems that industry and production are confronted with it. Production scheduling is often planned in the industrial environments while productivity in production can improve significantly the expansion of simultaneous optimization of the scheduling plan. Production scheduling and production are two areas that have attracted much attention in...
متن کاملan iterated greedy algorithm for flexible flow lines with sequence dependent setup times to minimize total weighted completion time
this paper explores the flexile flow lines where setup times are sequence- dependent. the optimization criterion is the minimization of total weighted completion time. we propose an iterated greedy algorithm (iga) to tackle the problem. an experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of iga are compared against those of some other exist...
متن کاملMinimizing sum of completion times on a single machine with sequence-dependent family setup times
This paper presents a branch-and-bound (B&B) algorithm for minimizing the sum of completion times in a singlemachine scheduling setting with sequence-dependent family setup times. The main feature of the B&B algorithm is a new lower bounding scheme that is based on a network formulation of the problem. With extensive computational tests, we demonstrate that the B&B algorithm can solve problems ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Dynamics in Nature and Society
سال: 2009
ISSN: 1026-0226,1607-887X
DOI: 10.1155/2009/970510